Grokking Complexity of Simple AI

Started by ebuc

Replies
6
Posts
7
Page
1 / 1

Conversation

#1 β€’β€’β€’

Grokking via AI complexity. This is from 2 years ago. At 7:55 the introduce Heinleins Stranger in a Strangeland context of the word to Grok and go on from there. Ive time stamped the vid at 6:50 to see where they accidentally had their neuronic-like set turned for couple of days went from the AI doing very poorly to generalizing And at 12:27 some interesting structuring is beginning to appear, as well as before > > Im still watching this neuronic unfolding. At 14:15 the show how** Pi usage** in the configuration is first shown.


At 33:00 someone else states that AI is less like building animals and more like building ghosts as fundamentally differrent points in space as possible intelligences.

https://www.youtube.com/watch?v=D8GOeCFFby4

Edit comment

#2 β€’β€’β€’

Grokking the Anti-robot.

https://www.youtube.com/watch?v=J8aBnNHdv_o

Edit post

#3 β€’β€’β€’

Groks...Is that those plastic sandals.


You either love them or hate them.


Sort of like Marmite or Brussels Sprouts.

Edit post

#4 β€’β€’β€’
@SergeantLynch
Groks...Is that those plastic sandals.


glowing protein sandals being created by AI 500 million years before nature would evolve them. Is AI artificial evolution on steroids?

.

..' An artificial intelligence (AI) model has simulated half a billion years of molecular evolution to create the code for a previously unknown protein, according to a new study. The glowing protein, which is similar to those found in jellyfish and corals, may help in the development of new medicines, researchers say.


...Proteins are one of the building blocks of life and perform various functions in the body, such as building muscles and fighting disease. The simulated protein, named esmGFP, only exists as computer code, but contains the blueprint for a previously unknown type of green fluorescent protein. In nature, green fluorescent proteins give fluorescent jellyfish and corals their glow.


...The sequence of letters that spell out the instructions to make esmGFP is only 58% similar to the closest known fluorescent protein, which is a human-modified version of a protein found in bubble-tip sea anemones (Entacmaea quadricolor) β€” colorful sea creatures that look like they have bubbles on the ends of their tentacles. The rest of the sequence is unique, and would require a total of 96 different genetic mutations to evolve. These changes would have taken more than 500 million years to evolve naturally, according to the study. '...

https://www.livescience.com/technology/artificial-intelligence/new-glowing-molecule-invented-by-ai-would-have-taken-500-million-years-to-evolve-in-nature-scientists-say

Edit post

#5 β€’β€’β€’

found the Claude Hiaku web site --at bottom of this message-- related to the 6-dimensional manifolds-- I first saw here time stamped > Grokking utube --used in identifying lines of text endings, beginnings and other. So the engeneering code writers did stuff interesting stuff so they could visualize what their algorithms were doing.


Im scrolled about 1/4 of way on the page { below } to see the interactive graphics that we grab and spin.


AI hyper-dimensional{?} vectoring of manifolds......' Character count is represented on a manifold in a 6 dimensional subspace (jagged line). This manifold can be approximately locally parametrized by the features we identified (crosses) '....

https://transformer-circuits.pub/2025/linebreaks/index.html

Edit post

#6 β€’β€’β€’

^^ Related to above

Here a 2013 Quanta article that may help to explain AI and LLM --tho as the 2nd paragraph on the page makes clear,-- no one really understands the exact complexities of AI mechanisms popping out what they do.


I guess I find this interesting because of my mechanical-like jobs Ive had in auto mechanics, carpentry, electrical and plumbing.

Quanta mag...' To understand how hypervectors make computing possible, let’s return to images with red circles and blue squares. First we need vectors to represent the variables SHAPE and COLOR. Then we also need vectors for the values that can be assigned to the variables: CIRCLE, SQUARE, BLUE and RED. '...


.Quanta mag link below...' The vectors must be distinct. This distinctness can be quantified by a property called orthogonality, which means to be at right angles. In 3D space, there are three vectors that are orthogonal to each other: One in the x direction, another in the y and a third in the z. In 10,000-dimensional space, there are 10,000 such mutually orthogonal vectors '...

https://www.quantamagazine.org/a-new-approach-to-computation-reimagines-artificial-intelligence-20230413/

Edit post

#7 β€’β€’β€’

β€œGrokking" in AI refers to a phenomenon where a neural network, after overfitting training data (100% training accuracy but poor validation performance), continues training for a long time and suddenly discovers a generalized solution, achieving high validation accuracy

. This process is characterized by a dramatic, often sudden, transition from memorizing training data to finding a simpler, underlying pattern. 

Recent research suggests that grokking is intimately tied to the complexity dynamics of the neural network's internal representations, effectively acting as a form of compression. 

Complexity Dynamics of Grokking

  1. The Rise and Fall of Complexity: During the initial, overfitting phase of training, the model's complexity rises as it memorizes the training data. Later, as the model "grokks" (generalizes), this complexity drops sharply.
  2. Minimal Description Length (MDL): The phenomenon is explained by the MDL principle, which states that the best model is the one that minimizes the sum of its complexity and the entropy of the data it tries to explain. In this view, the model starts by storing data (high complexity) and later finds a compact algorithm (low complexity) that represents the data more efficiently.
  3. Phase Transition: Grokking is considered a phase transition in the learning dynamics, where the network moves from a high-complexity regime to a low-complexity regime. 

Key Factors and Measurements

  1. Spectral Entropy: To measure this, researchers often use spectral entropy of the weights, which quantifies the effective dimension or "complexity" of the network.
  2. Linear Mapping Number (LMN): A metric used for ReLU networks, LMN serves as a proxy for measuring complexity before generalization.
  3. Regularization: While sometimes occurring naturally, proper regularization (like weight decay or adding noise) is crucial to encourage the network to move from high-complexity memorization to low-complexity generalization.
  4. Data Structure: Grokking often occurs when the data has an underlying structure (e.g., modular arithmetic, or datasets with strong hierarchical class-subclass relationships) that can be discovered. 

Relation to "Grokking" (Book/Concept)

While the scientific phenomenon describes this abrupt, late-stage understanding, the term "Grokking" is also popularly used in educational resources (like Grokking Algorithms or Grokking Simplicity) to mean developing a deep, intuitive, and, ironically, simple understanding of complex subjects, often through visualization and practical examples. 


Edit post